Traveling in randomly embedded random graphs
نویسندگان
چکیده
منابع مشابه
Traveling in Randomly Embedded Random Graphs
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a geodesic of length arbitrarily close to their Euclidean distance, and analyze the minimum length Traveling Salesperson Tour, extending the BeardwoodHalton-Hammersl...
متن کاملOn the Stretch Factor of Randomly Embedded Random Graphs
We consider a random graph G(n, p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u, v} of vertices have a distance in the weighted graph, and a Euclidean distance. The stretch factor of the embedded graph is defined as the maximum ratio of these two distances, over all...
متن کاملRandomly colouring random graphs
We consider the problem of generating a colouring of the random graph Gn,p uniformly at random using a natural Markov chain algorithm: the Glauber dynamics. We assume that there are β∆ colours available, where ∆ is the maximum degree of the graph, and we wish to determine the least β = β(p) such that the distribution is close to uniform in O(n log n) steps of the chain. This problem has been pr...
متن کاملLarge Deviations in Randomly Coloured Random Graphs
Models of random graphs are considered where the presence or absence of an edge depends on the random types (colours) of its vertices, so that whether or not edges are present can be dependent. The principal objective is to study large deviations in the number of edges. These graphs provide a natural example with two different non-degenerate large deviation regimes, one arising from large devia...
متن کاملAre randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2018
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20832